Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search
نویسندگان
چکیده
In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of board configurations. In this paper we concentrate our efforts on the game of Connect Four. Our results have shown significant speed-up, as well as a framework that relaxes common agent assumptions in game search. In addition, it allows game designers to easily modify the agent’s strategy by changing the goal from dominance to interaction.
منابع مشابه
Relationship between Game Location and Match Result with the Amount of Aggression: Iranian Premier League Football Teams
The purpose of this study was to investigate the relationship between game location (host advantage), match result (win, lose or tie) and the level of aggression in football teams of the Iranian Premier League. The study population consisted of Premier League Football teams (League XIII), and 60 matches (related to 4 teams) that were available for the researcher, were selected as the sample. Th...
متن کاملWell Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We prove existence of ε−SuppNE for any constant ε ∈ (0, 1), with only logarithmic support sizes for both players. Also we propose a polynomial–time construction of SuppNE, both for win lose and for arbitrary (normalized) bimatrix g...
متن کاملDecision Dynamics in Cooperative Search Based on Evolutionary Game Theory
Abstract. This paper investigates a search problem for a robotic group to find a target which appears randomly and stays for a fixed time interval. We assume that there are two search areas and the target appears in either of them. Under the situation, it is required to make a decision on which room to search while determining a control input. For the problem, we present an evolutionary game th...
متن کاملMartin Posch WIN STAY , LOSE SHIFT OR IMITATION – ONLY THE CHOICE OF PEERS COUNTS
Win Stay, Lose Shift as well as imitation strategies for iterated games rely on an aspiration level. With both learning rules a move is repeated unless the pay-o fell short of the aspiration level. I investigate social adaptation mechanisms for the aspiration level and their impact on the eÆciency of learning in a large population of agents that repeatedly play one round of a symmetric 2 2 game...
متن کاملHubs and Authorities of the English Premier League for 2010-2011
In this work author applies well known web search algorithm Hyperlink – Induced Topic Search (HITS) to problem of ranking football teams in English Premier League (EPL). The algorithm allows the ranking of the teams using the notions of hubs and authorities well known for ranking pages in the World Wide Web. Results of the games introduced as a graph where losing team ‘gives a link’ to a winnin...
متن کامل